Fairness comparison of FAST TCP and TCP Reno

In networking, it is often required to quantify by how much one protocol is fairer than another and how certain parameter setting and/or protocol enhancements improve fairness. This paper provides a framework to evaluate the fairness of various protocols in a general telecommunications network. Within this framework, there are two key components: (1) a benchmark and (2) a single dimension metric. We suggest to use the max-min fairness bandwidth allocation as the benchmark and the Euclidean distance between any bandwidth allocation under any protocol and the max-min bandwidth allocation as the metric. Explicitly, we provide a method to compare the fairness of two sets of bandwidth allocation under two different protocols for a given network by using this metric. On the basis of this new framework, we evaluate the fairness of FAST TCP and TCP Reno relative to the max-min fairness criteria. The distance between the max-min fair allocation and allocations based on each of the two protocols is measured using the Euclidian norm. We derive explicit expressions for these distances for a general network and compare the fairness of these two protocols by using their corresponding utility functions. Finally, we numerically demonstrate how this method can be applied to compare the fairness of FAST TCP and TCP Reno for a “Parking Lot” linear network and for the NSFNET Backbone network. In addition to merely a comparison between protocols, such numerical results can provide guidelines for better choice of parameters to make a protocol fairer in a given scenario.